Computation of k-out-of-n System Reliability via Reduced Ordered Binary Decision Diagrams

Composition of Reduced Ordered Binary Decision Diagrams

A widely accepted opinion is that, under a certain ordering restriction, the class of Reduced Ordered Binary Decision Diagrams (ROBDDs) is closed under composition. However, in this paper we show that this is not correct. We formulate necessary and sufficient conditions for the composition of two ROBDDs to result in a non-reduced OBDD. Ignoring these conditions may lead to an incorrect conclusi...

Learning Ordered Binary Decision Diagrams

This note studies the learnability of ordered binary decision diagrams (obdds). We give a polynomial-time algorithm using membership and equivalence queries that nds the minimum obdd for the target respecting a given ordering. We also prove that both types of queries and the restriction to a given ordering are necessary if we want minimality in the output, unless P=NP. If learning has to occur ...

Ordered Binary Decision Diagrams and Minimal Trellises

Ordered binary decision diagrams (OBDDs) are graph-based data structures for representing Boolean functions. They have found widespread use in computer-aided design and in formal veriication of digital circuits. Minimal trellises are graphical representations of error-correcting codes that play a prominent role in coding theory. This paper establishes a close connection between these two graphi...

Ordered Binary Decision Diagrams as Knowledge-Bases

Reasoning with Ordered Binary Decision Diagrams

We consider problems of reasoning with a knowledge-base, which is represented by an ordered binary decision diagram, for two cases of general and Horn knowledge-bases. Our main results say that both 2nding a model of a knowledge-base and deducing from a knowledge-base can be done in linear time for a general knowledge-base, but that abduction is NP-complete even for a Horn knowledge-base. Then,...